Introduction to Fireworks Algorithm
نویسندگان
چکیده
Inspired by fireworks explosion at night, conventional fireworks algorithm (FWA) was developed in 2010. Since then, several improvements and some applications were proposed to improve the efficiency of FWA. In this paper, the conventional fireworks algorithm is first summarized and reviewed and then three improved fireworks algorithms are provided. By changing the ways of calculating numbers and amplitudes of sparks in fireworks’ explosion, the improved FWA algorithms become more reasonable and explainable. In addition, the multi-objective fireworks algorithm and the graphic processing unit (GPU) based fireworks algorithm are also presented, particularly the GPU based fireworks algorithm is able to speed up the optimization process considerably. Extensive experiments on 13 benchmark functions demonstrate that the three improved fireworks algorithms significantly increase the accuracy of found solutions, yet decrease the running time dramatically. At last, some applications of fireworks algorithm are briefly described, while its shortcomings and future research directions are identified.
منابع مشابه
Hybridized Fireworks Algorithm for Global Optimization
In this paper we introduce hybridized fireworks algorithm for global optimization problems. We replaced Gaussian search method from the original fireworks algorithm with the search equation adopted from the firefly algorithm. To test our approach, we implemented six standard bound-constrained benchmarks and performed comparative analysis with the basic fireworks algorithm, as well as with two o...
متن کاملOpposition-Based Adaptive Fireworks Algorithm
A fireworks algorithm (FWA) is a recent swarm intelligence algorithm that is inspired by observing fireworks explosions. An adaptive fireworks algorithm (AFWA) proposes additional adaptive amplitudes to improve the performance of the enhanced fireworks algorithm (EFWA). The purpose of this paper is to add opposition-based learning (OBL) to AFWA with the goal of further boosting performance and ...
متن کاملSolving Set Covering Problem with Fireworks Explosion
To solve the Set Covering Problem we will use a metaheuristic Fireworks Algorithm inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm (FWA) consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection ...
متن کاملFireworks Explosion Can Solve the Set Covering Problem
The Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero/one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we will use a metaheuristic called Fireworks Algorithm (FWA) inspired by the fireworks explosion. Through the observation of the way that fireworks...
متن کاملAdaptive Mutation Dynamic Search Fireworks Algorithm
The Dynamic Search Fireworks Algorithm (dynFWA) is an effective algorithm for solving optimization problems. However, dynFWA easily falls into local optimal solutions prematurely and it also has a slow convergence rate. In order to improve these problems, an adaptive mutation dynamic search fireworks algorithm (AMdynFWA) is introduced in this paper. The proposed algorithm applies the Gaussian m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJSIR
دوره 4 شماره
صفحات -
تاریخ انتشار 2013